Stochastic Graphon Games: I. The Static Case
نویسندگان
چکیده
We consider static finite-player network games and their continuum analogs graphon games. Existence uniqueness results are provided as well convergence of the game optimal strategy profiles to for also show that equilibrium a provide approximate Nash equilibria Connections with mean field discussed. A motivating application Cournot competition is presented, explicit computation its provided.
منابع مشابه
Graphon games
The study of strategic behavior in large scale networks via standard game theoretical methods is a challenging, if not intractable, task. In this paper, we propose a way to approximate games played over networks of increasing size, by using the graph limiting concept of graphon. To this end, we introduce the new class of graphon games for populations of infinite size. We investigate existence a...
متن کاملStochastic blockmodel approximation of a graphon: Theory and consistent estimation
Non-parametric approaches for analyzing network data based on exchangeable graph models (ExGM) have recently gained interest. The key object that defines an ExGM is often referred to as a graphon. This non-parametric perspective on network modeling poses challenging questions on how to make inference on the graphon underlying observed network data. In this paper, we propose a computationally ef...
متن کاملNumerical Approximations for Stochastic Differential Games: The Ergodic Case
The Markov chain approximation method is a widely used, relatively easy to use, and efficient family of methods for the bulk of stochastic control problems in continuous time, for reßected-jump-diffusion type models. It has been shown to converge under broad conditions, and there are good algorithms for solving the numerical problems, if the dimension is not too high. We consider a class of sto...
متن کاملRepeated Games with Partial Monitoring: the Stochastic Signaling Case
In this work we extend a result of Lehrer characterizing the correlated equilibrium payoffs in undiscounted two player repeated games with partial monitoring to the case in which the signals are permitted to be stochastic. In particular we develop appropriate versions of Lehrer’s concepts of “indistinguishable” and “more informative.” We also show that any payoff associated with a (correlated) ...
متن کاملDynamic Potential Games: The Discrete-Time Stochastic Case
This paper concerns a class of nonstationary discrete–time stochastic noncooperative games. Our goals are threefold. First, we characterize Nash equilibria by means of the Euler equation approach. Second, we characterize subclasses of dynamic potential games. Finally, within one of this subclasses we identify a further subclass for which Nash equilibria are also Pareto (or cooperative) solutions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2022
ISSN: ['0364-765X', '1526-5471']
DOI: https://doi.org/10.1287/moor.2021.1148